A Proof of the Conjecture of Zantema on a Persistent Property of Term Rewriting Systems
نویسنده
چکیده
A property P of term rewriting system is persistent if for any many-sorted term rewriting system R, R has the property P i its underlying term rewriting system (R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sorts. This is the positive solution to a problem of Zantema, which has been appeared as Rewriting Open Problem 60 in literature.
منابع مشابه
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P i its underlying term rewriting system (R), which results from R by omitting its sort information, has the property P . It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort. This is the posit...
متن کاملSolution to the Problem of Zantema on a Persistent Property of Term Rewriting
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system Θ(R), which results from R by omitting its sort information, has the property P . It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort.
متن کاملPersistence of Termination for Term Rewriting Systems with Ordered Sorts
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema’s result can be extended to term rewriting ...
متن کاملTermination of Term Rewriting: Interpretation and Type Elimination
We investigate proving termination of term rewriting systems by interpretation of terms in a well-founded monotone algebra. The well-known polynomial interpretations can be considered as a particular case in this framework. A classiication of types of termination , including simple termination, is proposed based on properties in the semantic level. A transformation on term rewriting systems eli...
متن کاملTotal Termination of Term Rewriting is Undecidable
Usually termination of term rewriting systems (TRS's) is proved by means of a mono-tonic well-founded order. If this order is total on ground terms, the TRS is called totally terminating. In this paper we prove that total termination is an undecidable property of nite term rewriting systems. The proof is given by means of Post's Correspondence Problem.
متن کامل